Logical Stochastic Optimization
نویسنده
چکیده
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming [Saad and Pontelli, 2006; Saad, 2006; Saad, 2007a]. This is established by allowing probability optimization aggregates, e.g., minimum and maximum in the language of probability answer set programming to allow minimization or maximization of some desired criteria under the probabilistic environments. We show the application of the proposed logical stochastic optimization framework under the probability answer set programming to two stages stochastic optimization problems with recourse.
منابع مشابه
Stochastic Logical Effort and Smart Monte Carlo for Timing Yield Estimation and Optimization
This paper presents novel techniques for timing yield optimization and for yield estimation in the presence of large statistical process variations in integrated circuits. The techniques are based on our generalization of the logical effort delay model to circuits with stochastic parameter variations. In the spirit of the standard logical effort formalism, the stochastic gate delay model we pro...
متن کاملDuality gaps in nonconvex stochastic optimization
We consider multistage stochastic optimization models containing nonconvex constraints, e.g., due to logical or integrality requirements. We study three variants of Lagrangian relaxations and of the corresponding decomposition schemes, namely, scenario, nodal and geographical decomposition. Based on convex equivalents for the Lagrangian duals, we compare the duality gaps for these decomposition...
متن کاملAnt Colony Optimisation for Exploring Logical Gene-Gene Associations in Genome Wide Association Studies
In this paper a search for the logical variants of gene-gene interactions in genome-wide association study (GWAS) data using ant colony optimisation is proposed. The method based on stochastic algorithms is tested on a large established database from the Wellcome Trust Case Control Consortium and is shown to discover logical operations between combinations of single nucleotide polymorphisms tha...
متن کاملSolving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determination for CAs is NP-hard and recent algorithms have difficulty with problems involving goods and bids beyond the hundreds. We apply a new stochastic local search algorithm, Casanova, to this problem, and demonstrate ...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.3489 شماره
صفحات -
تاریخ انتشار 2013